Yet Another Type System for Lock-Free Processes
نویسنده
چکیده
A network of processes is lock free if every message produced in it is eventually consumed and if every process waiting for a message eventually receives one. We study a type system guaranteeing that well-typed process networks are lock free. Despite its minimality, our type system subsumes existing type-based approaches for lock freedom. In particular, we show that interactions whose lock freedom is guaranteed by design, because they are described by a global specification, can be realized as a well-typed network of processes.
منابع مشابه
Optimization of parameters of Anti lock Braking System for use in deep drawing
A new method for increasing LDR in deep drawing is application of anti-lock braking system (ABS) on blank holder. In this method, instead of applying a constant force on blank and control the metal flow, the ABS system holds and releases the blank several times (20 to 50 times) which results increasing LDR. This study investigates the effect of different parameters of ABS on improving the condi...
متن کاملOptimization of parameters of Anti lock Braking System for use in deep drawing
A new method for increasing LDR in deep drawing is application of anti-lock braking system (ABS) on blank holder. In this method, instead of applying a constant force on blank and control the metal flow, the ABS system holds and releases the blank several times (20 to 50 times) which results increasing LDR. This study investigates the effect of different parameters of ABS on improving the condi...
متن کاملA Type System for Lock-Free Processes
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ ⊢ P as “Γ is an abstraction of a concrete process P .” (The relation “⊢” corresponds to a pair of abstraction/co...
متن کاملAre lock-free concurrent algorithms practically wait-free? Citation
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While ...
متن کاملA Type System for Lock-Free Processes1
Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ P as “Γ is an abstraction of a concrete process P .” (The relation “ ” corresponds to a pair of abstraction/conc...
متن کامل